Ant colony optimization for job shop scheduling using multi-attribute dispatching rules
نویسندگان
چکیده
This paper proposes a heuristic method based on ant colony optimization to determine the suboptimal allocation of dynamic multi-attribute dispatching rules to maximize job shop system performance (four measures were analyzed: mean flow time, max flow time, mean tardiness, and max tardiness). In order to assure high adequacy of the job shop system representation, modeling is carried out using discrete-event simulation. The proposed methodology constitutes a framework of integration of simulation and heuristic optimization. Simulation is used for evaluation of the local fitness function for ants. A case study is used in this paper to illustrate how performance of a job shop production system could be affected by dynamic multiattribute dispatching rule assignment.
منابع مشابه
Ant Colony Optimisation for multi-level assembly job shop scheduling
Job shop scheduling is one of the most explored areas in the last few decades. Although it is very commonly witnessed in real-life situations, very less investigation has been carried out in scheduling operations of multi-level jobs, which undergo serial, parallel, and assembly operations in an assembly job shop. In this work, some of the dispatch rules, which have best performances in scheduli...
متن کاملMultiple Job Shop - Scheduling using Hybrid Heuristic Algorithm
problems are solved by a heuristic algorithm based on the hybrid of priority dispatching rules according to an ant colony optimization algorithm. The objective function is to minimize the makespan, i.e. total completion time, in which a simultanous presence of various kinds of ferons is allowed. By using the suitable hybrid of priority dispatching rules, the process of finding the best solution...
متن کاملA Performance Study for the Multi-objective Ant Colony Optimization Algorithms on the Job Shop Scheduling Problem
Most of the research on job shop scheduling problem are concerned with minimization of a single objective. However, the real world applications of job shop scheduling problems are involved in optimizing multiple objectives. Therefore, in recent years ant colony optimization algorithms have been proposed to solve job shop scheduling problems with multiple objectives. In this paper, some recent m...
متن کاملSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Ant colony optimisation, a constructive metaheuristic inspired by the foraging behaviour of ants, has been applied to a wide range of problems since its inception. Many of these are production scheduling problems such as the job shop, in which a collection of operations (grouped into jobs) must be scheduled for processing on different machines. In typical ACO applications, solutions are generat...
متن کاملUsing a Bee Colony Algorithm for Neighborhood Search in Job Shop Scheduling Problems
This paper describes a population-based approach that uses a honey bees foraging model to solve job shop scheduling problems. The algorithm applies an efficient neighborhood structure to search for feasible solutions and iteratively improve on prior solutions. The initial solutions are generated using a set of priority dispatching rules. Experimental results comparing the proposed honey bee col...
متن کامل